Using Rippling for Equational Reasoning

This paper presents techniques to guide equational reasoning in a goal directed way. Suggested by rippling methods developed in the eld of inductive theorem proving we use annotated terms to represent syntactical diierences of formulas. Based on these annotations and on hierarchies of function symbols we deene diierent abstractions of formulas which are used for planning of proofs. Rippling techniques are used to reene single planning steps, e.g. the application of a bridge lemma, on a next planning level.